Algorithmic Semi-algebraic Geometry and Topology -- Recent Progress and Open Problems
نویسنده
چکیده
We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms for computing the Betti numbers of semialgebraic sets. Aside from describing these results, we discuss briefly the background as well as the importance of these problems, and also describe the main tools from algorithmic semi-algebraic geometry, as well as algebraic topology, which make these advances possible. We end with a list of open problems.
منابع مشابه
38 COMPUTATIONAL and QUANTITATIVE REAL ALGEBRAIC GEOMETRY
Computational and quantitative real algebraic geometry studies various algorithmic and quantitative questions dealing with the real solutions of a system of equalities, inequalities, and inequations of polynomials over the real numbers. This emerging field is largely motivated by the power and elegance with which it solves a broad and general class of problems arising in robotics, vision, compu...
متن کامل37 Computational and Quantitative Real Algebraic Geometry
Computational and quantitative real algebraic geometry studies various algorithmic and quantitative questions dealing with the real solutions of a system of equalities, inequalities, and inequations of polynomials over the real numbers. This emerging field is largely motivated by the power and elegance with which it solves a broad and general class of problems arising in robotics, vision, compu...
متن کاملExpressing the box cone radius in the relational calculus with real polynomial constraints
We show that there is a query expressible in first-order logic over the reals that returns, on any given semi-algebraic set A, for every point, a radius around which A is conical in every small enough box. We obtain this result by combining results from differential topology and real algebraic geometry, with recent algorithmic results by Rannou.
متن کاملAlgebraic Geometry Over Four Rings and the Frontier to Tractability
We present some new and recent algorithmic results concerning polynomial system solving over various rings. In particular, we present some of the best recent bounds on: (a) the complexity of calculating the complex dimension of an algebraic set (b) the height of the zero-dimensional part of an algebraic set over C (c) the number of connected components of a semi-algebraic set We also present so...
متن کاملRecent Progress and Open Problems in Algorithmic Convex Geometry
This article is a survey of developments in algorithmic convex geometry over the past decade. These include algorithms for sampling, optimization, integration, rounding and learning, as well as mathematical tools such as isoperimetric and concentration inequalities. Several open problems and conjectures are discussed on the way.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0708.2854 شماره
صفحات -
تاریخ انتشار 2006